INTEGRALITY GAPS OF 2 ― o(1) FOR VERTEX COVER SDPs IN THE LOVÁSZ―SCHRIJVER HIERARCHYGEORGIOU, Konstantinos; MAGEN, Avner; PITASSI, Toniann et al.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 3553-3570, issn 0097-5397, 18 p.Article

Monotone circuits for the majority functionHOORY, Shlomo; MAGEN, Avner; PITASSI, Toniann et al.Lecture notes in computer science. 2006, pp 410-425, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 16 p.Conference Paper

Sublinear geometric algorithmsCHAZELLE, Bernard; DING LIU; MAGEN, Avner et al.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 627-646, issn 0097-5397, 20 p.Article

Analysis of set-up time models : A metric perspectiveBACHMAT, Eitan; TAO KAI LAM; MAGEN, Avner et al.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 172-180, issn 0304-3975, 9 p.Article

Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applicationsMAGEN, Avner.Lecture notes in computer science. 2002, pp 239-253, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

INTEGRALITY GAPS OF SEMIDEFINITE PROGRAMS FOR VERTEX COVER AND RELATIONS TO ℓ₁ EMBEDDABILITY OF NEGATIVE TYPE METRICSHATAMI, Hamed; MAGEN, Avner; MARKAKIS, Evangelos et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 178-194, issn 0895-4801, 17 p.Article

On-line algorithms for market equilibriaANGELOPOULOS, Spyros; DAS SARMA, Atish; MAGEN, Avner et al.Lecture notes in computer science. 2005, pp 596-607, issn 0302-9743, isbn 3-540-28061-8, 12 p.Conference Paper

Approximating the weight of the euclidean minimum spanning tree in sublinear timeCZUMAJ, Artur; ERGÜN, Funda; FORTNOW, Lance et al.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 91-109, issn 0097-5397, 19 p.Article

A Rigorous Analysis for Set-Up Time Models : A Metric PerspectiveBACHMAT, Eitan; TAO KAI LAM; MAGEN, Avner et al.Lecture notes in computer science. 2006, pp 387-397, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 11 p.Conference Paper

Simple permutations mix wellHOORY, Shlomo; MAGEN, Avner; MYERS, Steven et al.Lecture notes in computer science. 2004, pp 770-781, issn 0302-9743, isbn 3-540-22849-7, 12 p.Conference Paper

How well can primal-dual and local-ratio algorithms perform?BORODIN, Allan; CASHMAN, David; MAGEN, Avner et al.Lecture notes in computer science. 2005, pp 943-955, issn 0302-9743, isbn 3-540-27580-0, 13 p.Conference Paper

Designing oligo libraries taking alternative splicing into accountSHOSHAN, Avi; GREBINSKIY, Vladimir; MAGEN, Avner et al.SPIE proceedings series. 2001, pp 86-95, isbn 0-8194-3944-4Conference Paper

Simple permutations mix wellHOORY, Shlomo; MAGEN, Avner; MYERS, Steven et al.Theoretical computer science. 2005, Vol 348, Num 2-3, pp 251-261, issn 0304-3975, 11 p.Conference Paper